/ leetcodesolve / 11. Container With Most Water.py
swadhinbiswas more problem · 2/6/2025
34f7472
50 lines · 1.1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50

from typing import List

class Solution:
    def maxArea(self, height: List[int]) -> int:
        leftpointer=0
        rightpointer=len(height)-1
        maxarea=0
        while leftpointer<rightpointer:
            h=min(height[leftpointer],height[rightpointer])
            width=rightpointer-leftpointer
            area=width*h
            maxarea=max(area,maxarea)
            if height[leftpointer]<height[rightpointer]:
                leftpointer+=1
            else:
                rightpointer-=1

        return  maxarea 


print(Solution().maxArea([1,8,6,2,5,4,8,3,7]))



class Solution:
    def maxArea(self, height: List[int]) -> int:
        left,maxarea,right=0,0,len(height)-1
        while left<right:
                h=min(height[left],height[right])
                width=right-left
                area=h*width
                maxarea=max(area,maxarea)
                if height[left]<height[right]:
                    left+=1
                else:
                    right-=1
        return maxarea


print(Solution().maxArea([1,8,6,2,5,4,8,3,7]))